Spheres of small diameter with long sweep-outs
نویسندگان
چکیده
منابع مشابه
Tree-decompositions with bags of small diameter
This paper deals with the length of a Robertson–Seymour’s tree-decomposition. The tree-length of a graph is the largest distance between two vertices of a bag of a tree-decomposition, minimized over all tree-decompositions of the graph. The study of this invariant may be interesting in its own right because the class of bounded tree-length graphs includes (but is not reduced to) bounded chordal...
متن کاملSuperconnectivity of regular graphs with small diameter
A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any r-regular graph of diameter D and odd girth g that if D ≤ g − 2, then the graph is super-κ when g ≥ 5 and a complete graph otherwise.
متن کاملThe number of digraphs with small diameter
k) denote the l1um ber of of order nand diam-In this paper it is that: fixed k :~, ii) for every fixed k 1, n! where with D(n;d=n k:):Sn! (n) are polynomials of degree k 1 in n coefficients depending only on k. c;o:rres1)(:m(img results for undirected graphs given in [2]. of a vertex :r is the number of vertices of CJ that nr1PO'l'PP d-(x) is the number of vertices of G ~UII~~'~HU connected dig...
متن کاملDiameter of non-small cell lung cancer correlates with long-term survival: implications for T stage.
STUDY OBJECTIVES To determine the effect of tumor diameter on the long-term survival of patients with stage I non-small cell lung cancer (NSCLC) within a large multi-institutional database, and to assess the accuracy of the T-descriptor threshold of 3 cm. DESIGN AND PATIENTS A total of 9,191 patients > or = 20 years old with surgically treated stage I NSCLC < or = 6 cm registered in the Surve...
متن کاملVertex-symmetric Digraphs with Small Diameter
There is increasing interest in the design of dense vertex-symmetric graphs and digraphs as models of interconnection networks for implementing parallelism. In these systems many nodes are connected with relatively few links and short paths between them and each node may execute, without modifications, the same communication software. In this paper we give new families of dense vertex-symmetric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2012
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2012-11391-7